WORST_CASE(?,O(n^2))

Solution:
---------

  "a" :: [] -(2)-> "A"(3, 3)
  "activate" :: ["A"(0, 4)] -(13)-> "A"(0, 0)
  "f" :: ["A"(1, 0)] -(8)-> "A"(0, 0)
  "g" :: ["A"(0, 0)] -(2)-> "A"(2, 0)
  "n__a" :: [] -(0)-> "A"(0, 0)
  "n__a" :: [] -(0)-> "A"(0, 4)
  "n__a" :: [] -(0)-> "A"(10, 6)
  "n__a" :: [] -(0)-> "A"(13, 13)
  "n__f" :: ["A"(0, 0)] -(1)-> "A"(1, 0)
  "n__f" :: ["A"(4, 4)] -(0)-> "A"(0, 4)
  "n__f" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "n__g" :: ["A"(0, 4)] -(4)-> "A"(0, 4)
  "n__g" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "n__g" :: ["A"(0, 0)] -(0)-> "A"(4, 0)


Cost Free Signatures:
---------------------

  "a" :: [] -(0)-> "A"_cf(0, 0)
  "activate" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "n__a" :: [] -(0)-> "A"_cf(0, 0)
  "n__f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "n__g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"n__a\"_A" :: [] -(0)-> "A"(1, 0)
  "\"n__a\"_A" :: [] -(0)-> "A"(0, 1)
  "\"n__f\"_A" :: ["A"(0)] -(1)-> "A"(1, 0)
  "\"n__f\"_A" :: ["A"(0)] -(0)-> "A"(0, 1)
  "\"n__g\"_A" :: ["A"(0)] -(0)-> "A"(1, 0)
  "\"n__g\"_A" :: ["A"(0)] -(1)-> "A"(0, 1)